A Unified View of Consequence Relation, Belief Revision and Conditional Logic
نویسندگان
چکیده
The notion of minimality is widely used in three different areas of Artificial Intelligence: non-monotonic reasoning, belief revision, and conditional reasoning. However, it is difficult for the readers of the literature in these areas to perceive the similarities clearly, because each formalization in those areas uses its own language sometimes without referring to other for-malizations. We define ordered structures and families of ordered structures as the common ingredient of the semantics of all the works above. We also define the logics for ordered structures and families. We present a uniform view of how minimality is used in these three areas, and shed light on deep reciprocal relations among different approaches of the areas by using the ordered structures and the families of ordered structures. 1 Introduction The notion of minimality is proving to be a key unifying idea in three different areas of Artificial Intelligence: nonmonotonic reasoning, belief revision, and conditional reasoning. However, it is difficult for the readers of the literature in these areas to perceive the similarities clearly. The models used differ, sometimes superficially, sometimes in depth, and the notation is different, making it hard to apply results on, say, conditional logic to, say, belief revision. Even within the same area there is confusion, as, for example, different authors use different formalisms for conditional logic, sometimes without relating their proposals to the literature. We present a uniform view of how minimality is used in these three areas , shedding light on deep connections among the areas. We clarify differences and similarities between different approaches by classifying them according to the notion of minimality that they are based on. The first field in which minimality plays a crucial role is nonmonotonic reasoning. Shoham [1987] proposes a uniform approach to subsuming various formalisms of nonmonotonic reasoning in terms of preftrenttal relations among interpretations, Kraus, Lehmann and Magidor [1990] propose several consequence relations that capture general patterns of nonmonotonic reasoning. A consequence relation, denoted by means that is a good enough reason to believe or that is a plausible consequence of We can regard their work as an extension of Shoham's work since some consequence relations can be characterized in terms of preferential relations among possible worlds. The second field in which minimality is discussed is knowledge base revision and update. Alchourron, Gardenfors and Makinson [3985] propose, on philosophical grounds, a set of rationality postulates that belief revision operators must satisfy, …
منابع مشابه
Possibilistic Logic, Preferential Models, Non-monotonicity and Related Issues
The links between Shoham's preference logic and possibilistic logic, a numerical logic of uncertainty based on Zadeh's possibility measures, are investigated. Starting from a fuzzy set of preferential interpretations of a propositional theory, we prove that the notion of preferential entailment is closely related to a previously introduced notion of conditional possibility. Conditional possibil...
متن کاملA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
In this paper we present a duality between nonmonotonic consequence relations and well-founded convex geometries. On one side of the duality we consider nonmonotonic consequence relations satisfying the axioms of an infinitary variant of System P, which is one of the most studied axiomatic systems for nonmonotonic reasoning, conditional logic and belief revision. On the other side of the dualit...
متن کاملA nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals
Using Gärdenfors’s notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer If ¬A then B if all we know is A∨B while must not generally infer If ¬A then B if all we know is {A∨B,A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditio...
متن کاملIncorporating Specificity in Extended Logic Programs for Belief Revision
In this paper a new operator for agent’s implicit belief revision is presented. This operator is conceptually based on the following requirement: an agent should find first an explanation for the observations it makes before it tries to revise its beliefs. As a consequence, the proposed belief revision model does not agree with the principle of minimal change, commonly accepted. A translation o...
متن کاملConsiderations on Updates of Logic Programs
Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynamic logic programs and investigate their semantical properties, looking at them from perspectives such as a belief revision and abstract consequence relation view. Since the approach does not respect minimality of change, we refi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991